Program Comprehension in GROOVE

This paper presents a (partial) solution to the case study on Program Comprehension, proposed in the GraBaTs’09 contest. Our tool of choice is GROOVE, a graph transformation tool initially designed as a model checker for graph grammars. GROOVE has been under development for several years and new features are being implemented. One of our current interests is on program analysis and model transformation, hence the attempt to solve this case study. The first task proposed, viz. a filtering query, falls outside the current scope of GROOVE and thus was not tackled. We give a solution to the second task in the case study, namely the construction of a Control Flow Graph (CFG) and of a Program Dependence Graph (PDG) for a piece of program source code given as input. The rest of this paper is organised as follows. First, in Section 2, we give a brief introduction on GROOVE. In Section 3 we explain how the input file provided with the case study was converted to a representation suitable for GROOVE. Next, we present the solution to the elaboration of the CFG (in Section 4) and of the PDG (in Section 5). Finally, Section 6 concludes.